A similarity measure for stereo feature matching
نویسندگان
چکیده
An approach to stereo feature matching is presented with the introduction of a similarity measure for evaluating and confirming a stereo match. The contributions of this study are reflected in (1) the development of a similarity measure which evaluates a stereo match based on feature locality and gray-level gradient associated with the feature; and (2) the use of a matching procedure that integrates local and global matching strategies based on matching first those features with the highest similarity measure among the set of all highest similarities found locally under confined search spaces, ensuring that each feature is matched with a high degree of certainty. A left-to-right and right-to-left consistency check is used for each feature to comply with the uniqueness constraint and to confirm if a potential match can be declared a correct match.
منابع مشابه
Evaluation of Similarity Measures for Template Matching
Image matching is a critical process in various photogrammetry, computer vision and remote sensing applications such as image registration, 3D model reconstruction, change detection, image fusion, pattern recognition, autonomous navigation, and digital elevation model (DEM) generation and orientation. The primary goal of the image matching process is to establish the correspondence between two ...
متن کاملDistinctive Similarity Measure for stereo matching under point ambiguity
The point ambiguity owing to the ambiguous local appearances of image points is one of the main causes making the stereo problem difficult. Under the point ambiguity, local similarity measures are easy to be ambiguous and this results in false matches in ambiguous areas. In this paper, we present a new similarity measure to resolve the point ambiguity problem based on the idea that the distinct...
متن کاملFeatures Stereo Matching Based on Fuzzy Logic
This paper presents an entire scheme for the estimation of a sparse disparity map from stereo pair images. In contrary to a dense disparity map, for which disparity values are calculated for each pixel of image, the sparse disparity map is determined only for some distinguished set of pixels from an image. The pixels belong to this set are called features. Therefore, in the first stage the algo...
متن کاملDense Stereo Disparity Maps - Real-time Video Implementation by the Sparse Feature Sampling
To realize the real time dense stereo disparity map (DDM) running at a video rate of 30 fps, the dynamic time warp algorithm (DTW) is time wise a bottle neck despite its robustness for stereo matching. The DTW method requires to calculate a large similarity matrix S of the size N for the raster size N , if pixel-by-pixel matching is attempted. The computation time to calculate S is significant ...
متن کاملStereo Matching for Unconstrained Face Recognition - Ph.D. Proposal
Unconstrained face recognition is a problem of fundamental importance in computer vision. We propose to address this problem by using stereo matching to judge the similarity of two, 2D images of faces. Stereo matching allows for arbitrary, physically valid, continuous correspondences. We show that the stereo matching cost provides a very robust measure of similarity of faces that is insensitive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
دوره 6 10 شماره
صفحات -
تاریخ انتشار 1997